Mass problems and intuitionistic higher-order logic
نویسندگان
چکیده
منابع مشابه
Mass problems and intuitionistic higher-order logic
In this paper we study a model of intuitionistic higher-order logic which we call the Muchnik topos. The Muchnik topos may be defined briefly as the category of sheaves of sets over the topological space consisting of the Turing degrees, where the Turing cones form a base for the topology. We note that our Muchnik topos interpretation of intuitionistic mathematics is an extension of the well kn...
متن کاملA Hilbert-style axiomatization of higher-order intuitionistic logic
Two Hilbert calculi for higher-order intuitionistic logic (or theory of types) are introduced. The first is defined in a language that uses just exponential types of power type, and corresponds to Bell’s local set theory. The second one is defined in a language with arbitrary functional types and correspond to Church’s simple type theory. We show that both systems are sound and complete with re...
متن کاملA complete axiomatization of higher-order intuitionistic logic
Two Hilbert calculi for higher-order logic (or theory of types) are introduced. The first is defined in a language that uses just exponential types of power type, and it is obtained by adapting the sequent calculus for local set theory introduced by Bell in [3]. The second one, originally introduced in [5], is defined in a language with arbitrary functional types. Using usual topos semantics we...
متن کاملIntuitionistic Completeness of First-Order Logic
We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the intended semantics of iFOL and mFOL. Our proof is intuitionistic and provides an effective procedure Prf that converts uniform minimal evidence into a formal fi...
متن کاملExecuting Higher Order Logic
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are compiled into a functional program. Functions and inductively defined relations can be mixed. Inductive definitions must be such that they can be executed in Prolog style but requiring only matching rather than unificat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computability
سال: 2016
ISSN: 2211-3576,2211-3568
DOI: 10.3233/com-150041